Influence of ScaI and Natriuretic Peptide (NP) Clearance Receptor Polymorphisms of the NP System on NP Concentration in Chronic Heart Failure
نویسندگان
چکیده
منابع مشابه
Influence of ScaI and natriuretic peptide (NP) clearance receptor polymorphisms of the NP System on NP concentration in chronic heart failure.
BACKGROUND Genetic variants related to the natriuretic peptide (NP) system [ScaI mutated allele (A1) of the atrial NP (ANP) gene and the C variant of the natriuretic peptide clearance receptor (NPRC) gene] have been identified as independent risk factors for cardiovascular morbidity and mortality. Despite the importance of NPs in heart failure (HF), the role of these polymorphisms in HF has not...
متن کاملOn Monadic NP vs. Monadic co-NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic (1 ;). Monadic NP is the class of problems expressible in monadic Z;, i.e., 1: with the restriction that the second-order quantifiers range only over sets (as opposed to ranging over, say, binary relations). We prove that connectivity of finite graph...
متن کاملNP-Completeness and Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A,B) of NPsets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP-sets that is NP-hard. We show under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, which provi...
متن کاملAbout the impossibility to prove P=NP or P!=NP and the pseudo-randomness in NP
The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P NP question and the “Deterministic” versus “Non Deterministic” nature of a problem, and more specifically at the temporal nature of the complexity within theNP class of problems. Let us remind that the NP class is called ...
متن کاملTuring Machines , P , NP and NP - completeness
I assume that most students have encountered Turing machines before. (Students who have not may want to look at Sipser’s book [3].) A Turing machine is defined by an integer k ≥ 1, a finite set of states Q, an alphabet Γ, and a transition function δ : Q×Γk → Q×Γk−1×{L, S,R}k where: • k is the number of (infinite, one-dimensional) tapes used by the machine. In the general case we have k ≥ 3 and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Clinical Chemistry
سال: 2007
ISSN: 0009-9147,1530-8561
DOI: 10.1373/clinchem.2007.088302